Multilevel projection algorithm for solving obstacle problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Projection Algorithm for Solving Obstacle Problems

K e y w o r d s O b s t a c l e problem, Multilevel projection, Convergence, Finite element, Error estimate. 1 . I N T R O D U C T I O N The obstacle problem we consider here can be described as follows: find the equilibrium position u = u(x), x E f~ C R 2 of an elastic membrane constrained to lie above a given obstacle @ = @(x) under an external force f (x ) . Then u(x) is the formal solution ...

متن کامل

A Two-Grids/Projection Algorithm for Obstacle Problems

In order to emphasize the possible relation between discontinuous and continuous approximations on different meshes, a two-grids method for the resolution of parabolic variational inequality problems is presented. The numerical methodology combines a time splitting algorithm to decouple a diffusion phenomenon from an obstacle problem. The diffusion problem is solved by using finite differences,...

متن کامل

An algorithm for solving the double obstacle problems

In this paper, we extend the algorithm in Xue and Cheng [L. Xue, X.L. Cheng, An algorithm for solving the obstacle problems, Comput. Math. Appl. 48 (2004) 1651–1657] for solving the double obstacle problem. We try to find the approximated region of the contact in the double obstacle problem with less computation time by iteration. Numerical example is given for the double obstacle problem for t...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2001

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(01)00115-8